Dynamic voltage scaling based energy-minimized partial task offloading in fog networks

Wireless Networks - With the dynamic voltage scaling (DVS) technology, the terminal node (TN) can dynamically adjust its computational speed, thus providing a new way to save energy during task...     

我国水-能源-粮食耦合关系及影响因素

为缓解我国水、能源和粮食资源紧张问题，促进资源可持续利用，构建水-能源-粮食系统，利用耦合协调度模型对我国的30个省（自治区、直辖市）进行测算,并利用空间杜宾模型分析主要影响因素。结果表明：2003—2017年，我国能源、粮食评价[JP]指数高于水资源评价指数，系统综合评价指数逐年递增；大部分省份耦合协调度处于初级协调水平且呈现逐年上升的态势，个别省份耦合协调度濒临失调；耦合协调度空间自相关性较强，虽有明显波动，但是呈现逐年加强的态势；影响耦合协调度的主要因素有从业人口数、固定资产投资额、人均生产总值、人口总数、[JP]文盲人口占比、工业污染排放、城镇化。     

Graph-Theoretic Method on Topology Identification of Stochastic Multi-weighted Complex Networks with Time-Varying Delayed Coupling Based on Adaptive Synchronization

Neural Processing Letters - This paper is concerned with topology identification of stochastic multi-weighted complex networks based on adaptive synchronization. Different from previous work,...     

Rapid anti-solvent vapor-assisted synthesis of CsPbBr3/Cs4PbBr6 microcrystals with high brightness and stability of green light emission

Journal of Materials Science - The CsPbBr3/Cs4PbBr6 perovskite composite material has received wide attention due to its good stability and photoelectric properties, and it is promising to appear...     

A Tradeoff Between Accuracy and Speed for K-Means Seed Determination

With a sharp increase in the information volume, analyzing and retrieving this vast data volume is much more essential than ever. One of the main techniques that would be beneficial in this regard is called the Clustering method. Clustering aims to classify objects so that all objects within a cluster have similar features while other objects in different clusters are as distinct as possible. One of the most widely used clustering algorithms with the well and approved performance in different applications is the k-means algorithm. The main problem of the k-means algorithm is its performance which can be directly affected by the selection in the primary clusters. Lack of attention to this crucial issue has consequences such as creating empty clusters and decreasing the convergence time. Besides, the selection of appropriate initial seeds can reduce the cluster’s inconsistency. In this paper, we present a new method to determine the initial seeds of the k-mean algorithm to improve the accuracy and decrease the number of iterations of the algorithm. For this purpose, a new method is proposed considering the average distance between objects to determine the initial seeds. Our method attempts to provide a proper tradeoff between the accuracy and speed of the clustering algorithm. The experimental results showed that our proposed approach outperforms the Chithra with 1.7% and 2.1% in terms of clustering accuracy for Wine and Abalone detection data, respectively. Furthermore, achieved results indicate that comparing with the Reverse Nearest Neighbor (RNN) search approach, the proposed method has a higher convergence speed.